A Comparison Among Simple Algorithms for Linear Programming

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

A goal programming approach for fuzzy flexible linear programming problems

 We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...

Randomized Algorithms for Linear Programming

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

Simple Linear - Time Algorithms

We present global and local algorithms for evaluating minimal xed points of dependency graphs, a general problem in xed-point computation and model checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and \reverse list" ...